Near-optimal matrix recovery from random linear measurements
نویسندگان
چکیده
منابع مشابه
Near-optimal matrix recovery from random linear measurements
In matrix recovery from random linear measurements, one is interested in recovering an unknown M -by-N matrix X0 from n < MN measurements yi = Tr(Ai X0) where each Ai is an M -by-N measurement matrix with i.i.d random entries, i = 1, . . . , n. We present a novel matrix recovery algorithm, based on approximate message passing, which iteratively applies an optimal singular value shrinker – a non...
متن کاملSparse Signal Recovery from Nonadaptive Linear Measurements
The theory of Compressed Sensing , the emerging sampling paradigm ‘that goes against the common wisdom’ , asserts that ‘one can recover signals in R from far fewer samples or measurements , if the signal has a sparse representation in some orthonormal basis, from m ≈ O(klogn), k ≪ n nonadaptive measurements . The accuracy of the recovered signal is as good as that attainable with direct knowled...
متن کاملStable optimizationless recovery from phaseless linear measurements
We address the problem of recovering an n-vector from m linear measurements lacking sign or phase information. We show that lifting and semidefinite relaxation suffice by themselves for stable recovery in the setting of m = O(n logn) random sensing vectors, with high probability. The recovery method is optimizationless in the sense that trace minimization in the PhaseLift procedure is unnecessa...
متن کاملNear Optimal Signal Recovery From Random Projections And Universal Encoding Strategies
Suppose we are given a vector f in R . How many linear measurements do we need to make about f to be able to recover f to within precision ǫ in the Euclidean (l2) metric? Or more exactly, suppose we are interested in a class F of such objects— discrete digital signals, images, etc; how many linear measurements do we need to recover objects from this class to within accuracy ǫ? This paper shows ...
متن کاملTight oracle bounds for low-rank matrix recovery from a minimal number of random measurements
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entries. We show that properly constrained nuclear-normminimization stably recovers a low-rank matrix from a constant number of noisy measurements per degree of freedom; this seems to be the first result of this nature. Fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2018
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.1705490115